Faster and Simpler Approximation of Stable Matchings
نویسندگان
چکیده
منابع مشابه
Faster and Simpler Approximation of Stable Matchings
We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(nm) time, where n denotes the number of people and m is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extensio...
متن کاملA Faster and Simpler 2-Approximation Algorithm for Block Sorting
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is NP-hard and all of the previously known heuristics lack proof of any approximation ratio. We present here an approximation algorithm for the block sorting problem with approximation ratio of 2 and run time O(n). The app...
متن کاملA Simpler and Faster Version of Two-Dimensional Gel Electrophoresis Using Vertical, Mini SDS-PAGE Apparatus
We have modified one of the most useful methods of protein separation; namely, two dimensional gel electrophoresis (2-DE). This modified version of 2-DE is not only simpler and easier but also faster than all the currently available methods. In this method, isoelectric focusing is carried out in the first dimension using a vertical sodium dodecyl sulfate polyacrylamide gel electrop...
متن کاملFaster Principal Component Regression and Stable Matrix Chebyshev Approximation
We solve principal component regression (PCR), up to a multiplicative accuracy 1+γ, by reducing the problem to Õ(γ−1) black-box calls of ridge regression. Therefore, our algorithm does not require any explicit construction of the top principal components, and is suitable for large-scale PCR instances. In contrast, previous result requires Õ(γ−2) such black-box calls. We obtain this result by de...
متن کاملFaster and Simpler Minimal Conflicting Set Identification
Let C be a finite set of n elements and R = {r1, r2, . . . , rm} a family of m subsets of C. A subset X of R verifies the Consecutive Ones Property (C1P) if there exists a permutation P of C such that each ri in X is an interval of P . A Minimal Conflicting Set (MCS) S ⊆ R is a subset of R that does not verify the C1P, but such that any of its proper subsets does. In this paper, we present a ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2014
ISSN: 1999-4893
DOI: 10.3390/a7020189